A liberalized system of quantificational deduction.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Logic Programming and Verification System for Recursive Quantificational Logic

In this paper, we describe a logic programming and program verification system which is based on quantifier elimination techniques and axiomatization rather than on more common method of doing logic programming using the Herbrand-Prawitz-Robinson unification algorithm without occur-check. This system is shown to have interesting properties for logic programming and includes a number of advanced...

متن کامل

A Heterogeneous Parallel Deduction System

This paper describes the architecture, implementation and performance, of a heterogeneous parallel deduction system (HPDS). The HPDS uses multiple deduction components, each of which attempts to find a refutation of the same input set, but using different deduction formats. The components cooperate by distributing clauses they generate to other components. The HPDS has been implemented in Prolo...

متن کامل

Quantificational prepositions

In this note we discuss a couple of Dutch prepositions that systematically combine with a common noun phrase, without any determiner. We explore whether we can analyze these prepositions as having ‘incorporated’ a determiner, semantically speaking, and discuss the consequences of this analysis for the status of bare nominals, the demarcation of syntactic and semantic categories, and the relatio...

متن کامل

The Resolution Of Quantificational Ambiguity In The Tendum System

A method is described for handling the ambiguity and vagueness that is often found in quantifications the semantically complex relations between nominal and verbal constituents. In natural language certain aspects of quantification are often left open; it is argued that the analysis of quantification in a model-theoretic framework should use semantic representations in which this may also be do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1964

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093957977